منابع مشابه
A Multi-Objective Method for Network Reconfiguration (TECHNICAL NOTE)
This paper presents an algorithm based on multi-objective approach for network reconfiguration. Multiple objectives are considered for reduction in the system power loss, deviations of the nodes voltage and transformers loading imbalance, while subject to a radial network structure in which all the loads must be energized and no branch current constraint is violated. These three objectives are ...
متن کاملA conjugate gradient based method for Decision Neural Network training
Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...
متن کاملA Self-Routing Permutation Network
A self–routing permutation network is a connector which can set its own switches to realize any one-to-one mapping of its inputs onto its outputs. Many permutation networks have been reported in the literature, but none with self–routing property, except crossbars and cellular permutation arrays which have excessive cost. This paper describes a self–routing permutation network which has O(log n...
متن کاملCryptanalysis of a Substitution-Permutation Network Using Gene Assembly in Ciliates
In this paper we provide a novel approach for breaking a significant class of block ciphers, the so-called SPN ciphers, using the process of gene assembly in ciliates. Our proposed scheme utilizes, for the first time, the Turing-powerful potential of gene assembly procedure of ciliated protozoa into the real world computations and has a fewer number of steps than the other proposed schemes to b...
متن کاملSorting Network Relaxations for Vector Permutation Problems
The Birkhoff polytope (the convex hull of the set of permutation matrices) is frequently invoked informulating relaxations of optimization problems over permutations. The Birkhoff polytope is representedusing Θ(n) variables and constraints, significantly more than the n variables one could use to representa permutation as a vector. Using a recent construction of Goemans [1], we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2020
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0240888